Optimal control of finite source priority queues with computer system applications

Finite-source Retrial Queues with Applications*

We consider a single-server retrial queueing system with a finite number of homogeneous sources generating requests after a random time. The service of an arriving customer finding the server idle starts immediately; otherwise the request enters into an orbit from where the calls are repeated after a random time. Upon completion of a service, with a certain probability the server searches for a...

Optimal control of queues in computer networks

The design of rate allocation and queue length control in computer networks is treated as a stochastic optimal control problem. The performance index is chosen to achieve the twin objectives of minimising queue length fluctuations and fully utilising the available bandwidth. Simple, practically realisable optimal control schemes are obtained for both LANs and WANs. An adaptive scheme is propose...

Optimal Purely Functional Priority Queues

Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert, and meld in O(1) worst-case time, and deleteMin in O(log n) worst-case time. These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt Brodal’s data structure to a purely functional setting. In doing so, we both simplify the data structu...

Tool supported modeling of sensor communication networks by using finite - source priority retrial queues ∗

The main aim of the present paper is to draw the attention of the readers of this special issue to the modeling issues of sensor networks. The novelty of this investigation is the introduction of servers vacation combined with priority customers for finite-source retrial queues and its application to wireless sensor networks. In this paper we analyze a priority finite-source retrial queue with ...

Many-Sources Delay Asymptotics with Applications to Priority Queues